Tied Kronecker Product Graph Models to Capture Variance in Network Populations
نویسندگان
چکیده
منابع مشابه
Modeling the Variance of Network Populations with Mixed Kronecker Product Graph Models
Several works are focused in the analysis of just one network, trying to replicate, match and understanding the most possible characteristics of it, however, in these days it becomes more important to match the distribution of the networks rather than just one graph. In this work we will theoretically demonstrate that the Kronecker product graph models (KPGMs) [1] is unable to model the natural...
متن کاملBlock Kronecker Product Graph Model
Since Kronecker Product Graph Model (KPGM) was introduced, it has been widely used to model real networks. The characteristics of the model specially its single fractal structure have made KPGM one of the most important algorithm of the last years. However, the utilization of a single fractal structure decreases the potential of KPGM by limiting the graph space covered by the model. In this pap...
متن کاملDimension of Marginals of Kronecker Product Models
A Kronecker product model is the set of visible marginal probability distributions of an exponential family whose sufficient statistics matrix factorizes as a Kronecker product of two matrices, one for the visible variables and one for the hidden variables. We estimate the dimension of these models by the maximum rank of the Jacobian in the limit of large parameters. The limit is described by t...
متن کاملOn the diameter of the Kronecker product graph
Let and be two undirected nontrivial graphs. The Kronecker product of and denoted by with vertex set , two vertices and are adjacent if and only if and . This paper presents a formula for computing the diameter of by means of the diameters and primitive exponents of factor graphs.
متن کاملShifted Kronecker Product Systems
Abstract. A fast method for solving a linear system of the form (A(p) ⊗ · · · ⊗ A(1) − λI)x = b is given where each A(i) is an ni-by-ni matrix. The first step is to convert the problem to triangular form (T (p) ⊗ · · · ⊗ T (1) − λI)y = c by computing the (complex) Schur decompositions of the A(i). This is followed by a recursive back-substitution process that fully exploits the Kronecker struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Knowledge Discovery from Data
سال: 2018
ISSN: 1556-4681,1556-472X
DOI: 10.1145/3161885